package 每日一题;

import java.util.ArrayList;
import java.util.List;

public class 两个字符串相同的最小操作 {

    public int minDistance(String word1, String word2) {
        //找到两个字符串最长子序列
        int m=word1.length();
        int n=word2.length();
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i < m+1; i++) {
            for (int j = 1; j < n+1; j++) {
                if (word1.charAt(i-1)==word2.charAt(j-1)){
                    dp[i][j]=dp[i-1][j-1]+1;
                }
                else
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
            }
        }
        return m+n-dp[m][n]*2;
    }
}
